Fun with Latin Squares
نویسندگان
چکیده
Abstract Do you want to know what an anti-chiece Latin square is? Or a non-consecutive toroidal modular We invented ton of new types squares, some inspired by existing Sudoku variations. can’t wait introduce them and answer important questions, such as: do they even exist? If so, under conditions? What are their interesting properties? And how we generate them?
منابع مشابه
Fun and Games with Sums of Squares
This blog post is an introduction to the “Sum of Squares” (SOS) algorithm from my biased perspective. This post is rather long I apologize. If you’d rather ”see the movie”, I’ll be giving a TCS+ seminar about this topic on Wednesday, February 26th 1pm EST. If you prefer the live version, I’ll be giving a summer course in Stockholm from June 30 till July 4th. I’ve been told that there are worse ...
متن کاملLatin Squares with No Transversals
A k-plex in a latin square of order n is a selection of kn entries that includes k representatives from each row and column and k occurrences of each symbol. A 1-plex is also known as a transversal. It is well known that if n is even then Bn, the addition table for the integers modulo n, possesses no transversals. We show that there are a great many latin squares that are similar to Bn and have...
متن کاملLatin Squares with Forbidden Entries
An n× n array is avoidable if there exists a Latin square which differs from the array in every cell. The main aim of this paper is to present a generalization of a result of Chetwynd and Rhodes involving avoiding arrays with multiple entries in each cell. They proved a result regarding arrays with at most two entries in each cell, and we generalize their method to obtain a similar result for a...
متن کاملLifting Redundancy from Latin Squares to Pandiagonal Latin Squares
In the pandiagonal Latin Square problem, a square grid of size N needs to be filled with N types of objects, so that each column, row, and wrapped around diagonal (both up and down) contains an object of each type. This problem dates back to at least Euler. In its specification as a constraint satisfaction problem, one uses the all different constraint. The known redundancy result about all dif...
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Recreational mathematics magazine
سال: 2023
ISSN: ['2182-1968', '2182-1976']
DOI: https://doi.org/10.2478/rmm-2023-0003